A Logic with Conditional Probability Operators
نویسندگان
چکیده
We present a sound and strongly complete axiomatization of a reasoning about linear combinations of conditional probabilities, including comparative statements. The developed logic is decidable, with a PSPACE containment for the decision procedure.
منابع مشابه
A Logic with Kolmogorov Style Conditional Probabilities
In this paper we investigate a probability logic with conditional probability operators. The logic (denoted LPP ) allows making statements such as CP≥s(α | β), with the intended meaning ”the conditional probability of α given β is at least s”. Conditional probabilities are defined in the usual Kolmogorv style: P (α | β) = P (α∧β) P (β) , P (β) > 0. A possible-world approach is used to give sema...
متن کاملA Logic with Higher Order Conditional Probabilities
We investigate probability logic with the conditional probability operators. This logic, denoted LCP , allows making statements such as: P sα, CP s(α | β), CP 0(α | β) with the intended meaning “the probability of α is at least s”, “the conditional probability of α given β is at least s”, “the conditional probability of α given β at most 0”. A possible-world approach is proposed to give semanti...
متن کاملA First-order Conditional Probability Logic with Iterations
We investigate a first-order conditional probability logic with equality, which is, up to our knowledge, the first treatise of such logic. The logic, denoted LFPOIC=, allows making statements such as: CP>s(φ, θ), and CP6s(φ, θ), with the intended meaning that the conditional probability of φ given θ is at least (at most) s. The corresponding syntax, semantic, and axiomatic system are introduced...
متن کاملProbabilistic Implications
A new family of implication operators, called probabilistic implications, is introduced. The suggested implications are based on conditional copulas and make a bridge between probability theory and fuzzy logic. It is shown that some well-known fuzzy implications appear as a particular probabilistic implications. Therefore, it seems that this new family of implication operators might be a useful...
متن کاملRevising Imprecise Probabilistic Beliefs in the Framework of Probabilistic Logic Programming
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base which contains a set of conditional events with probability intervals. In this paper, we investigate the issue of revising such a PLP in light of receiving new information. We propose postulates for revising PLPs when a n...
متن کامل